Convergence rate analysis of domain decomposition methods for obstacle problems
نویسنده
چکیده
منابع مشابه
Convergence Rate Analysis of a Multiplicative Schwarz Method for Variational Inequalities
This paper derives a linear convergence for the Schwarz overlapping domain decomposition method when applied to constrained minimization problems. The convergence analysis is based on a minimization approach to the corresponding functional over a convex set. A general framework of convergence is established for some multiplicative Schwarz algorithm. The abstract theory is particularly applied t...
متن کاملRate of Convergence for some constraint decomposition methods for nonlinear variational inequalities
Some general subspace correction algorithms are proposed for a convex optimization problem over a convex constraint subset. One of the nontrivial applications of the algorithms is the solving of some obstacle problems by multilevel domain decomposition and multigrid methods. For domain decomposition and multigrid methods, the rate of convergence for the algorithms for obstacle problems is of th...
متن کاملConvergence rate analysis of an asynchronous space decomposition method for convex Minimization
We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as special cases parallel domain decomposition methods and multigrid methods for solving elliptic partial differential equations. In particular, the method generalizes the additive Schwarz domain decomposition methods to allow for as...
متن کاملUpdating finite element model using frequency domain decomposition method and bees algorithm
The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...
متن کاملMultigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids
In this paper, we develop and analyze an efficient multigrid method to solve the finite element systems from elliptic obstacle problems on two dimensional adaptive meshes. Adaptive finite element methods (AFEMs) based on local mesh refinement are an important and efficient approach when the solution is non-smooth. An optimality theory on AFEM for linear elliptic equations can be found in Nochet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Num. Math.
دوره 9 شماره
صفحات -
تاریخ انتشار 2001